Fibonacci-run graphs II: Degree sequences
نویسندگان
چکیده
Fibonacci cubes are induced subgraphs of hypercube graphs obtained by restricting the vertex set to those binary strings which do not contain consecutive 1s. This class has been studied extensively and generalized in many different directions. Induced on with restricted runlengths as vertices define Fibonacci-run graphs. These have same number cubes, but fewer edges graph theoretical properties. Basic properties presented a companion paper, while this paper we consider nature degree sequences The generating function obtain is refinement sequences, corollaries, specializations. We also several viewed partially ordered set, discuss its embedding
منابع مشابه
Parallel enumeration of degree sequences of simple graphs II
In the paper we report on the parallel enumeration of the degree sequences (their number is denoted by G(n)) and zerofree degree sequences (their number is denoted by (Gz(n)) of simple graphs on n = 30 and n = 31 vertices. Among others we obtained that the number of zerofree degree sequences of graphs on n = 30 vertices is Gz(30) = 5 876 236 938 019 300 and on n = 31 vertices is Gz(31) = 22 974...
متن کاملDegree sequences of monocore graphs
A k-monocore graph is a graph which has its minimum degree and degeneracy both equal to k. Integer sequences that can be the degree sequence of some k-monocore graph are characterized as follows. A nonincreasing sequence of integers d1, . . . , dn is the degree sequence of some k-monocore graph G, 0 ≤ k ≤ n− 1, if and only if k ≤ di ≤ min {n− 1, k + n− i} and
متن کاملToeplitz transforms of Fibonacci sequences
We introduce a matricial Toeplitz transform and prove that the Toeplitz transform of a second order recurrence sequence is another second order recurrence sequence. We investigate the injectivity of this transform and show how this distinguishes the Fibonacci sequence among other recurrence sequences. We then obtain new Fibonacci identities as an application of our transform.
متن کاملMincuts in generalized Fibonacci graphs of degree 3
We investigate the structure of mincuts in an n-vertex generalized Fibonacci graph of degree 3 and show that the number |CF3(n)| of mincuts in this graph is equal to |CF3(n− 1)| + |CF3(n− 2)| + |CF3(n− 3)| − |CF3(n− 4)| − |CF3(n− 5)|+ 1.
متن کاملEnergy of Graphs, Matroids and Fibonacci Numbers
The energy E(G) of a graph G is the sum of the absolute values of the eigenvalues of G. In this article we consider the problem whether generalized Fibonacci constants $varphi_n$ $(ngeq 2)$ can be the energy of graphs. We show that $varphi_n$ cannot be the energy of graphs. Also we prove that all natural powers of $varphi_{2n}$ cannot be the energy of a matroid.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2021
ISSN: ['1872-6771', '0166-218X']
DOI: https://doi.org/10.1016/j.dam.2021.05.018